package com.person.leetcode.editor.cn;

import java.util.Arrays;
import java.util.List;

/**
  * 1672.最富有客户的资产总量
  * 2022-04-14 17:05:45
**/
public class Sequence_1672_RichestCustomerWealth {
    public static void main(String[] args) {
        Solution solution = new Sequence_1672_RichestCustomerWealth().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = 0;
        for (int[] account : accounts) {
            int incoming = 0;
            for (int i : account) {
                incoming += i;
            }
            if (max < incoming){
                max = incoming;
            }
        }
        return max;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
